Metric dimension of symplectic dual polar graphs and symmetric bilinear forms graphs

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Metric dimension of dual polar graphs

A resolving set for a graph Γ is a collection of vertices S, chosen so that for each vertex v, the list of distances from v to the members of S uniquely specifies v. The metric dimension μ(Γ) is the smallest size of a resolving set for Γ. We consider the metric dimension of the dual polar graphs, and show that it is at most the rank over R of the incidence matrix of the corresponding polar spac...

متن کامل

On the metric dimension of bilinear forms graphs

In [R.F. Bailey, K. Meagher, On the metric dimension of Grassmann graphs, arXiv:1010.4495 ], Bailey and Meagher obtained an upper bound on the metric dimension of Grassmann graphs. In this note we show that qn+d−1+⌊ d+1 n ⌋ is an upper bound on the metric dimension of bilinear forms graphs Hq(n, d)when n ≥ d ≥ 2. As a result, we obtain an improvement on Babai’s most general bound for the metric...

متن کامل

The metric dimension and girth of graphs

A set $Wsubseteq V(G)$ is called a resolving set for $G$, if for each two distinct vertices $u,vin V(G)$ there exists $win W$ such that $d(u,w)neq d(v,w)$, where $d(x,y)$ is the distance between the vertices $x$ and $y$. The minimum cardinality of a resolving set for $G$ is called the metric dimension of $G$, and denoted by $dim(G)$. In this paper, it is proved that in a connected graph $...

متن کامل

the metric dimension and girth of graphs

a set $wsubseteq v(g)$ is called a resolving set for $g$, if for each two distinct vertices $u,vin v(g)$ there exists $win w$ such that $d(u,w)neq d(v,w)$, where $d(x,y)$ is the distance between the vertices $x$ and $y$. the minimum cardinality of a resolving set for $g$ is called the metric dimension of $g$, and denoted by $dim(g)$. in this paper, it is proved that in a connected graph $...

متن کامل

Solis Graphs and Uniquely Metric Basis Graphs

A set $Wsubset V (G)$ is called a resolving set, if for every two distinct vertices $u, v in V (G)$ there exists $win W$ such that $d(u,w) not = d(v,w)$, where $d(x, y)$ is the distance between the vertices $x$ and $y$. A resolving set for $G$ with minimum cardinality is called a metric basis. A graph with a unique metric basis is called a uniquely dimensional graph. In this paper, we establish...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 2013

ISSN: 0012-365X

DOI: 10.1016/j.disc.2012.09.023